Planar Point Sets with a Small Number of Empty Convex Polygons
نویسندگان
چکیده
A subset A of a finite set P of points in the plane is called an empty polygon, if each point of A is a vertex of the convex hull of A and the convex hull of A contains no other points of P . We construct a set of n points in general position in the plane with only ≈ 1.62n empty triangles, ≈ 1.94n empty quadrilaterals, ≈ 1.02n empty pentagons, and ≈ 0.2n empty hexagons.
منابع مشابه
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملEmpty convex polygons in planar point sets
The Erdős–Szekeres theorem inspired a lot of research. A frequent topic in this area is the study of the existence of so-called empty convex polygons in finite planar point sets. Let P be a finite set of points in general position in the plane. A convex k-gon G is called a k-hole (or empty convex k-gon) of P , if all vertices of G lie in P and no point of P lies inside G. Frequently we will mea...
متن کاملCounting Convex Polygons in Planar Point Sets
Given a set S of n points in the plane, we compute in time O(n) the total number of convex polygons whose vertices are a subset of S. We give an O(m n) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3; : : : ;m; previously known bounds were exponential (O(ndk=2e)). We also compute the number of empty convex polygons (resp., k-gons, k m) with vertices ...
متن کاملThe Helly Number of the Prime - coordinate Point Set
In this senior thesis, we study many different properties of symmetric point sets, focusing on points with only prime coordinates. The ultimate goal of this project is to find the Helly number of this prime space. This result is equivalent to finding the largest number of edges that a convex empty polygon is able to have within the space. While there are numeric ways to describe the convex bodi...
متن کامل